Strongly obtuse rational lattice triangles

نویسندگان

چکیده

We classify rational triangles which unfold to Veech surfaces when the largest angle is at least $\frac {3\pi }{4}$. When greater than {2\pi }{3}$, we show that unfolding not except possibly if it belongs one of six infinite families. Our methods include a criterion Mirzakhani and Wright built on work Möller McMullen, in most cases orbit closure cannot have rank 1.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rational Triangles with Equal Area

We consider the set of triangles in the plane with rational sides and a given area A. We show there are infinitely many such triangles for each possible area A. We also show that infinitely many such triangles may be constructed from a given one, all sharing a side of the original triangle, unless the original is equilateral. There are three families of triangles (including the isosceles ones) ...

متن کامل

Tiling Polygons with Lattice Triangles

Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the x-axis, we look at the problem of the location of the vertices for a tiling of the polygon using lattice triangles (i.e., triangles which are congruent to a triangle with the coordinates of the vertices being integer). We show that the coordinate of the vertices in any tiling are ratio...

متن کامل

Tilings of the sphere with right triangles III: the asymptotically obtuse families

Sommerville and Davies classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. However, if the edge-to-edge restriction is relaxed, there are other such triangles; here, we continue the classification of right triangles with this property begun in our earlier papers. We consider six families of triangles classified as “asymptotically obtuse”, and show that they c...

متن کامل

On Ehrhart Polynomials of Lattice Triangles

The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P ), i(P )) where b(P ) equals the number of lattice points on the boundary and i(P ) equals the number of interior lattice points. All possible pairs (b(P ), i(P )) are completely described by a theorem due to Scott. In this note, we describe the shape of the set of pairs (b(T ), i(T )) for lattice triangles ...

متن کامل

Some Induced Subgraphs of Strongly Regular Graphs with no Triangles

Let G be a strongly regular graph with no triangles (SRNT graph) with the parameters (n, k, 0, μ) , if v is a vertex of G, a subgraph which induced by the set of vertices at distance one denoted by G1(v) and subgraph which induced by the set of vertices at distance two denoted by G2(v). In this paper we introduce and study the subgraph which induced by the set U and denoted by G2(U) where, U ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2021

ISSN: ['2330-0000']

DOI: https://doi.org/10.1090/tran/8415